All q-ary equidistant 3-codes

The elements of {0, 1, . . . , q − 1} are called q-ary codewords of length n over a q-element alphabet. A code is a set of codewords. The Hammingdistance d(c1, c2) of two codewords c1 and c2 is the number of positions where they differ. A code C is called equidistant with distance d if the Hammingdistance of any two codewords is exactly d. Another, shorter name is: q-ary equidistant d-code. The binary case (q = 2) was studied in [6], [10], [8], [9], [7] and [13]. q-ary equidistant codes and their relationships to resolvable balanced incomplete block designs were considered in [11] and [12]. Paper [1] found the